CS1.301 Algorithm Analysis and Design (Monsoon 2023)

---

Announcements

• Teaching assistants: Posted on Moodle
• Schedule: Lectures: Tuesday and Friday, 10:00 – 11:25, Tutorial: Saturday, 12:40 - 13:40
• Classroom: H-205

Lectures

1. Introduction to Algorithm Analysis

   • Class notes (Includes the list of tentative topics)
   • References: Chapter 2 of [1]

2. Basic Graph Algorithms: Breadth first search

   • Class notes
   • References: Section 3.2 of [1]

3. Basic Graph Algorithms: Applications of Breadth first search

   • Class notes
   • References: Sections 3.3 and 3.4 of [1]

4. Basic Graph Algorithms: Depth first search

   • Class notes
   • References: Sections 3.2 and 3.5 of [1]

References

1. J. Kleinberg, and E. Tardos (2005), Algorithm Design, Pearson (Addison Wesley).
2. T. H. Cormen, C. E. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms (third edition, 2009), MIT press and McGraw Hill.
3. S. Dasgupta, C. Papadimitrou, and U. Vazirani, Algorithms (first edition, 2006), McGraw Hill Education.
4. J. Erickson, Algorithms (first edition, 2019).
5. A. Aho, J. Hopcraft, and J. Ullman, Design and Analysis of Algorithms (1974), Addison Wesley.